Formalization of Word-Order Shifts by Restarting Automata
نویسندگان
چکیده
The phenomenon of word order freedom plays an important role in syntactic analysis of many natural languages. This paper introduces a notion of a word order shift, an operation reflecting the degree of word order freedom of natural languages. The word order shift is an operation based upon word order changes preserving syntactic correctness, individual word forms, their morphological characteristics, and their surface dependency relations in a course of a stepwise simplification of a sentence, a so called analysis by reduction. The paper provides linguistic motivation for this operation and concentrates on a formal description of the whole mechanism through a special class of automata, so called restarting automata with the shift operation enhanced with a structured output, and their computations. The goal of this study is to clarify the properties of computations needed to perform (enhanced) analysis by reduction for free word order languages.
منابع مشابه
On the complexity of reductions by restarting automata
The paper provides linguistic observations as a motivation for a formal study of analysis by reduction (AR). It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, delete, and shift operations (DS-automata). The complexity of DS-automata is naturally measured by the number of deletions, and the number of word order shifts u...
متن کاملOn Minimalism of Analysis by Reduction by Restarting Automata
The paper provides linguistic observations as a motivation for a formal study of an analysis by reduction. It concentrates on a study of the whole mechanism through a class of restarting automata with meta-instructions using pebbles, with delete and shift operations (DSautomata). Four types of (in)finite sets defined by these automata are considered as linguistically relevant: basic languages o...
متن کاملOn Restarting Automata with Rewriting
Motivated by natural language analysis we introduce restarting automata with rewriting. They are acceptors on the one hand, and (special) regulated rewriting systems on the other hand. The computation of a restarting automaton proceeds in cycles: in each cycle, a bounded substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word. We sh...
متن کاملRelations and Transductions Realized by Restarting Automata
In the present thesis we introduce several ways of extending restarting automata to devices for realizing binary (word) relations, which is mainly motivated by linguistics. In particular, we adapt the notion of input/output-relations and proper-relations to restarting automata and to parallel communicating systems of two restarting automata (PC-systems). Further, we introduce a new model, calle...
متن کاملLookahead Hierarchies of Restarting Automata
The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.
متن کامل